Vectorization of Structure to Index Graph Databases
نویسندگان
چکیده
This paper addresses the problem of retrieval from graph databases. Graph databases store graph structures instead of tables. Typically, graph databases are applicable in domains that require storage and retrieval of structural information. One of the main issues in graph databases is retrieval of member graphs based on structure matching. Structure matching of graphs is a known NP-complete problem. In graph databases, this is compounded by the fact that structure matching has to be performed against a large number of graphs in the database. This paper addresses graph databases as a domain independent concept. They are shown to be defined by a property of dominance of either structure over attributes or vice versa. Retrieval from structure dominated graph databases are much more difficult than retrieval from attribute dominated graph databases. The paper also proposes a concept called “structure vectorization” for retrieval for indexing and retrieval from structure dominated graph databases.
منابع مشابه
Automated Vectorization and Labeling of Very Large Raster Hypsographic Map Images Using Contour Graph
This paper presents a very efficient method for vectorizing and labeling very large raster hypsographic map images. By extending the contour tree (Freeman and Morse, 1967) to a contour graph, open contour lines and carrying contour lines can be handled. The ambiguities of the topological relationships among contour lines are resolved using map structure information, i.e., elevation tags and ind...
متن کاملWiener Polarity Index of Tensor Product of Graphs
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
متن کاملA note on connectivity and lambda-modified Wiener index
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملApplication of Graph Theory: Relationship of Topological Indices with the Partition Coefficient (logP) of the Monocarboxylic Acids
It is well known that the chemical behavior of a compound is dependent upon the structure of itsmolecules. Quantitative structure – activity relationship (QSAR) studies and quantitative structure –property relationship (QSPR) studies are active areas of chemical research that focus on the nature ofthis dependency. Topological indices are the numerical value associated with chemical constitution...
متن کامل